By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 16, Issue 3, pp. 345-516

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A New Lower Bound for Tree-Width Using Maximum Cardinality Search

Brian Lucena

pp. 345-353

Nonlinearity of Boolean Functions and Hyperelliptic Curves

Jung Hee Cheon. and Seongtaek Chee

pp. 354-365

A High Girth Graph Construction

L. Sunil Chandran

pp. 366-370

Complexes of t-Colorable Graphs

Svante Linusson and John Shareshian

pp. 371-389

Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist

Ari Trachtenberg and Alexander Vardy

pp. 390-392

Testing of Clustering

Noga Alon, Seannie Dar, Michal Parnas, and Dana Ron

pp. 393-417

The Spectra of Cycle Prefix Digraphs

Francesc Comellas and Margarida Mitjana

pp. 418-421

On Polynomial-Factor Approximations to the Shortest Lattice Vector Length

Ravi Kumar and D. Sivakumar

pp. 422-425

A Theorem about the Channel Assignment Problem

Daniel Král' and Riste Skrekovski

pp. 426-437

Line Graphs of Helly Hypergraphs

Yury Metelsky and Regina Tyshkevich

pp. 438-448

List Partitions

Tomas Feder., Pavol Hell, Sulamita Klein, and Rajeev Motwani

pp. 449-478

Localized Eigenvectors from Widely Spaced Matrix Modifications

Xiangwei Liu., Gilbert Strang, and Susan Ott

pp. 479-498

Frameproof Codes

Simon R. Blackburn

pp. 499-510

On the b-Stable Set Polytope of Graphs without Bad K4

Dion Gijswijt and Alexander Schrijver

pp. 511-516